Solving the Single-Vehicle Self-Driving Car Trolley Problem Using Risk Theory and Vehicle Dynamics
نویسندگان
چکیده
منابع مشابه
New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کاملSolving the Trolley Problem
One might despair of ever arriving at a principle adequate to capturing and accommodating our intuitions about the full range of cases that have come to be known as “trolley problems” (roughly speaking, cases where one must choose whether to kill some to save others). But suppose there were such a principle, as indeed I imagine there probably is. For the moment, just call it Q. Is there such a ...
متن کاملSolving Vehicle Assignment Problem Using Evolutionary Computation
This paper examines the use of evolutionary computation (EC) to find optimal solution in vehicle assignment problem (VAP). The VAP refers to the allocation of the expected number of people in a potentially flooded area to various types of available vehicles in evacuation process. A novel discrete particle swarm optimization (DPSO) algorithm and genetic algorithm (GA) are presented to solve this...
متن کاملSolving the Trolley Problem
© 2016 John Wiley & Sons, Ltd. Published 2016 by John Wiley & Sons, Ltd. The Trolley Problem has baffled ethicists for decades (Foot 1978; Thomson 1985; Fischer and Ravizza 1992) and has, more recently, become a focal point for research in moral psychology (Petrinovich, O’Neill, and Jorgensen 1993; Greene et al. 2001; Edmonds 2013; Greene 2015). As the Trolley Problem’s interdisciplinary histor...
متن کاملSolving the multiple-depot vehicle scheduling problem
The Multiple-Depot Vehicle Scheduling Problem (MDVSP) is the problem where one wants to assign timetabled tasks to vehicles which are housed in multiple depots. This problem is highly relevant for the public transport domain, as competition grows fierce and companies need to stay competitive to survive. As solving the MDVSP optimally is difficult in practice, the aim of this thesis is to give a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science and Engineering Ethics
سال: 2019
ISSN: 1353-3452,1471-5546
DOI: 10.1007/s11948-019-00102-6